A Partition Refinement Algorithm for the -Calculus

The partition reenement algorithm 10, 6] is the basis for most of the tools for checking bisimulation equivalences and for computing minimal realisations of CCS-like nite state processes. In this paper, we present a partition reenement algorithm for the-calculus 7], a development of CCS where channel names can be communicated. It can be used to check bisimilarity and to compute minimal realisations of nite control processes | the-calculus counterpart of CCS nite state processes. The algorithm is developed for strong open bisimulation, and can be adapted to late and early bisimulations, as well as to weak bisimulations. To arrive at the algorithm, a few laws and four characterisations of open bisimulation are proved.